Clustering Algorithm for Distributed Real-Time Database sites
نویسندگان
چکیده
منابع مشابه
Implementing a Distributed Real-Time Database Manager
Conventional database systems are typically not used in time-critical applications due to poor performance and lack of predictability. Compared with uaditional databases, database systems for such applications have the distinct feature that they must satisfy timing constraints associated with transactions. Transactions in real-time database systems should be scheduled considering both data cons...
متن کاملOn Real-Time Distributed Geographical Database Systems
Advanced Traveler [r~format~on Systems (ATIS) under the intelligent Vehicle Highway Systems (IVHS) context require efficient information retrieval and updating in a dynamic environment and at different geographical scales. Some problems in ATIS can be solved based on the functionalities provided by GIS systems. However, extra requirements such as realtime response are not readily met in existin...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملA New Real-time Clustering Algorithm
Clustering is one of most important building fields in data mining and in machine learning in general. Most clustering algorithms is designed for off-line (or batch) processing, in which the clustering process repeatedly sweeps through the set of data samples in order to capture its underlying structure in a compact and efficient way. However, with the continuous increment of set of data sample...
متن کاملEfficient Priority Assignment Policies for Distributed Real-Time Database Systems
A lot of research works have been done in this filed of real-time database systems to seek for optimizing transaction scheduling. The findings of such studies examining the use of various algorithms of priority assignment policy have been discussed widely. One drawback of these approaches is presenting poor performance due to neglect repetitively missed real-time transactions. In this paper, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJCI. International Journal of Computers and Information
سال: 2015
ISSN: 1687-7853
DOI: 10.21608/ijci.2015.33957